Lower complexity bounds in justification logic
نویسندگان
چکیده
منابع مشابه
Lower complexity bounds in justification logic
Justification Logic studies epistemic and provability phenomena by introducing justifications/proofs into the language in the form of justification terms. Pure justification logics serve as counterparts of traditional modal epistemic logics, and hybrid logics combine epistemic modalities with justification terms. The computational complexity of pure justification logics is typically lower than ...
متن کاملA Complexity Question in Justification Logic
Bounds for the computational complexity of major justification logics were found in papers by Buss, N. Krupski, Kuznets, and Milnikel: logics J, J4, JT, LP and JD, were established to be Σ 2 -complete. A corresponding lower bound is also known for JD4, the system that includes the consistency axiom and positive introspection. However, no upper bound has been established so far for this logic. H...
متن کاملLower Bounds in Communication Complexity
The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to determine the value f(x, y). Communication complexity is a fundamental measure of complexity of functions. Lower bounds on this measure lead to lower bounds on many other measures of computational complexity. This monograph survey lower bou...
متن کاملThe Complexity of Probabilistic Justification Logic
Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in polynomial space. We show that this upper complexity bound is tight.
متن کاملOn the complexity of probabilistic justification logic
The logic PJ is a probabilistic logic over the basic justification logic J. In this paper we establish upper and lower bounds for the complexity of PJ. The main result of the paper is that the complexity of the logic PJ remains the same as the complexity of the logic J.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2012
ISSN: 0168-0072
DOI: 10.1016/j.apal.2011.09.010